Bandwidth theorem for random graphs

نویسندگان

  • Hao Huang
  • Choongbum Lee
  • Benny Sudakov
چکیده

A graph G is said to have bandwidth at most b, if there exists a labeling of the vertices by 1, 2, . . . , n, so that |i − j| ≤ b whenever {i, j} is an edge of G. Recently, Böttcher, Schacht, and Taraz verified a conjecture of Bollobás and Komlós which says that for every positive r,∆, γ, there exists β such that if H is an n-vertex r-chromatic graph with maximum degree at most ∆ which has bandwidth at most βn, then any graph G on n vertices with minimum degree at least (1−1/r+γ)n contains a copy of H for large enough n. In this paper, we extend this theorem to dense random graphs. For bipartite H, this answers an open question of Böttcher, Kohayakawa, and Taraz. It appears that for non-bipartite H the direct extension is not possible, and one needs in addition that some vertices of H have independent neighborhoods. We also obtain an asymptotically tight bound for the maximum number of vertex disjoint copies of a fixed r-chromatic graph H0 which one can find in a spanning subgraph of G(n, p) with minimum degree (1 − 1/r + γ)np.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the bandwidth of Mobius graphs

Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.

متن کامل

Spanning embeddings of arrangeable graphs with sublinear bandwidth

The Bandwidth Theorem of Böttcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175–205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this result to a-arrangeable graphs H with ∆(H) ≤ √ n/ log n, where n is the number of vertices of H. Our result implies that sufficiently large n-vertex graphs G with...

متن کامل

Lattice bandwidth of random graphs

McDiarmid, C. and Z. Miller, Lattice bandwidth of random graphs, Discrete Applied Mathematics 30 (1991) 221-227. The bandwidth of a random graph has been well studied. A natural generalization of bandwidth involves replacing the path as host graph by a multi-dimensional lattice. In this paper we investigate the corresponding behavior for random graphs.

متن کامل

Design and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints

Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...

متن کامل

Algorithmic graph theory

Introduction to graphs, Paths, cycles and trails Max-flow min-cut theorem, computing max s-t flows and min-cut Edge and Vertex Connectivity and Menger's theorem Maximum matching, Hall's theorem, algorithms for computing maximum matching in weighted and unweighted graphs. Edge and vertex colouring of graphs. Independent sets Planar graphs and algorithms for checking for planarity. The course nee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 102  شماره 

صفحات  -

تاریخ انتشار 2012